User-Defined Aggregates for Datamining
نویسندگان
چکیده
User-deened aggregates can be the linchpin of sophisticated datamining functions and other advanced database applications. This is demonstrated by our eecient implementation on DB2 of SQL3 user-deened aggregates extended with early returns, which we have used to implement several data mining algorithms. Aggregates with early returns are monotonic and can thus be used freely in recursive queries.
منابع مشابه
User - De ned Aggregates for DataminingHaixun
User-deened aggregates can be the linchpin of sophisticated datamining functions and other advanced database applications. This is demonstrated by our eecient implementation on DB2 of SQL3 user-deened aggregates extended with early returns, which we have used to implement several data mining algorithms. Aggregates with early returns are monotonic and can thus be used freely in recursive queries.
متن کاملUser - De ned Aggregates in Database
User-deened aggregates can be the linchpin of sophisticated datamining functions and other advanced database applications , but they nd little support in current database systems including Object-Relational databases. Three serious limitations of current databases are (i) the inability of introducing new aggregates (e.g., by coding them in a procedural language as proposed in SQL3), (ii) the in...
متن کاملThe ATLaS System and Its Powerful Database Language Based on Simple Extensions of SQL
A lack of power and extensibility in their query languages has seriously limited the generality of DBMSs and hampered their ability to support new applications domains, such as datamining. In this paper, we solve this problem by stream-oriented aggregate functions and generalized table functions definable by users in the SQL language itself– rather than in an external programming language. Thes...
متن کاملUser Defined Aggregates in Object-Relational Systems
User-defined aggregates are essential in many advanced database applications, particularly in expressing data mining functions, but they find little support in current systems including Object-Relational databases. Three serious limitations of current systems are (i) the inability of introducing new aggregates (e.g., by coding them in procedural language as originally proposed in SQL3), (ii) th...
متن کاملAggregates for Constraint Handling Rules
We extend the Constraint Handling Rules language with aggregates such as sum, count, findall, and min. The proposed extension features nested aggregate expressions over guarded conjunctions of constraints, a series of predefined aggregates, and application-tailored user-defined aggregates. We formally define the operational semantics of aggregates, and show how incremental aggregate computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999